Indefinite Summation and the Kronecker Delta
نویسندگان
چکیده
Indefinite summation, together with a generalized version of the Kronecker delta, provide a calculus for reasoning about various polynomial functions that arise in combinatorics, such as the Tutte, chromatic, flow, and reliability polynomials. In this paper we develop the algebraic properties of the indefinite summation operator and the generalized Kronecker delta from an axiomatic viewpoint. Our main result is that the axioms are equationally complete; that is, all equations that hold under the intended interpretations are derivable in the calculus.
منابع مشابه
Robust Stabilization of Interval Plants using Kronecker Summation Method
This paper deals with design of continuous-time robustly stabilizing Proportional-Integral (PI) controllers for interval systems using the combination of Kronecker summation method, sixteen plant theorem and an algebraic approach to controller tuning. The effectiveness and practical applicability of the proposed method is demonstrated in both simulation and real experiments including control of...
متن کاملGosper’s Algorithm and Accurate Summation as Definite Summation Tools
Sufficient conditions are given for validity of the discrete Newton-Leibniz formula when the indefinite sum is obtained either by Gosper’s algorithm or by Accurate Summation algorithm. It is shown that sometimes a polynomial can be factored from the summand in such a way that the safe summation range is inreased.
متن کاملAn Implementation of Karr’s Summation Algorithm in Mathematica∗
Implementations of the celebrated Gosper algorithm (1978) for indefinite summation are available on almost any computer algebra platform. We report here about an implementation of an algorithm by Karr, the most general indefinite summation algorithm known. Karr’s algorithm is, in a sense, the summation counterpart of Risch’s algorithm for indefinite integration. This is the first implementation...
متن کاملIndefinite summation with unspecified summands
We provide a new algorithm for indefinite nested summation which is applicable to summands involving unspecified sequences x(n). More than that, we show how to extend Karr’s algorithm to a general summation framework by which additional types of summand expressions can be handled. Our treatment of unspecified sequences can be seen as a first illustrative application of this approach.
متن کاملSymbolic Integration and Summation Using Homotopy Methods
The homotopy algorithm is a powerful method for indefinite integration of total derivatives, and for the indefinite summation of differences. By combining these ideas with straightforward Gaussian elimination, we construct an algorithm for the optimal symbolic integration or summation of expressions that contain terms that are not total derivatives or differences. The optimization consists of m...
متن کامل